High-Order Entropy Compressed Bit Vectors with Rank/Select
نویسندگان
چکیده
منابع مشابه
High-Order Entropy Compressed Bit Vectors with Rank/Select
We design practical implementations of data structures for compressing bit-vectors to support efficient rank-queries (counting the number of ones up to a given point). Unlike previous approaches, which either store the bit vectors plainly, or focus on compressing bit-vectors with low densities of ones or zeros, we aim at low entropies of higher order, for example 101010 . . . 10. Our implementa...
متن کاملEntropy-Constrained Scalar Quantization with a Lossy-Compressed Bit
We consider the compression of a continuous real-valued source X using scalar quantizers and average squared error distortion D. Using lossless compression of the quantizer’s output, Gish and Pierce showed that uniform quantizing yields the smallest output entropy in the limit D → 0, resulting in a rate penalty of 0.255 bits/sample above the Shannon Lower Bound (SLB). We present a scalar quanti...
متن کاملHigh - Order Motion Compensationfor Low Bit - Rate
The concept of high-order motion compensation is introduced. It is argued that in hybrid video coding, motion-compensated prediction has to be viewed as a source coding problem with a delity criterion. Based on our considerations, various high-order motion compensation approaches are presented that achieve signi-cantly improved video coding results. The designed motion-compensated predictors ac...
متن کاملRedundant Bit Vectors for Quickly Searching High-Dimensional Regions
Applications such as audio fingerprinting require search in high dimensions: find an item in a database that is similar to a query. An important property of this search task is that negative answers are very frequent: much of the time, a query does not correspond to any database item. We propose Redundant Bit Vectors (RBVs): a novel method for quickly solving this search problem. RBVs rely on t...
متن کاملPractical Dynamic Entropy-Compressed Bitvectors with Applications
Succinct/compressed data structures aim at providing the same functionality offered by classical data structures while using asymptotically less space. There exist several of these structures for a wide spectrum of applications ranging from strings over arbitrary alphabets to full-text indexing. Their theoretical promises have been met in practice in the static scenario, while the practicality ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Algorithms
سال: 2014
ISSN: 1999-4893
DOI: 10.3390/a7040608